2 Tullio Ceccherini - Silberstein and Michel Coornaert
نویسنده
چکیده
AmonoidM is called surjunctive if every injective cellular automata with finite alphabet over M is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite monoids, all finitely generated linear monoids, and all cancellative one-sided amenable monoids are surjunctive. We also prove that every limit of marked surjunctive monoids is itself surjunctive. On the other hand, we show that the bicyclic monoid and, more generally, all monoids containing a submonoid isomorphic to the bicyclic monoid are non-surjunctive.
منابع مشابه
Expansive Actions on Uniform Spaces and Surjunctive Maps
We present a uniform version of a result of M. Gromov on the surjunctivity of maps commuting with expansive group actions and discuss several applications.
متن کاملOn a Characterization of Locally Finite Groups in Terms of Linear Cellular Automata
We prove that a group G is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over G is injective.
متن کاملThe Garden of Eden theorem: old and new
We review topics in the theory of cellular automata and dynamical systems that are related to the Moore-Myhill Garden of Eden theorem.
متن کاملCellular Automata on Regular Rooted Trees
We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.
متن کاملGroups, Graphs, Languages, Automata, Games and Second-order Monadic Logic
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
متن کامل